Fast optimal aggregate point search for a merged set on road networks

Fast Nearest Neighbor Search on Road Networks

Nearest neighbor (NN) queries have been extended from Euclidean spaces to road networks. Existing approaches are either based on Dijkstra-like network expansion or NN/distance precomputation. The former may cause an explosive number of node accesses for sparse datasets because all nodes closer than the NN to the query must be visited. The latter, e.g., the Voronoi Network Nearest Neighbor (V N)...

Efficient Algorithms for Finding Optimal Meeting Point on Road Networks

Given a set of pointsQ on a road network, an optimal meeting point (OMP) query returns the point on a road networkG = (V,E) with the smallest sum of network distances to all the points in Q. This problem has many real world applications, such as minimizing the total travel cost for a group of people who want to find a location for gathering. While this problem has been well studied in the Eucli...

Fast point-to-point shortest path queries on dynamic road networks with interfal data

Fast point-to-point shortest path queries on dynamic road networks with interval data

Consider a weighted directed graph G = (V,A, c) (where c : A → R+) which represents a road network evaluated by travelling times (so the graph may not be Euclidean). Assuming that c changes every few minutes, that the cardinality of V is very large (several million vertices), and that each shortest path request must be answered in a few milliseconds, current technology does not allow us to find...

Adaptive search area for fast motion estimation

In this paper a new method for determining the search area for motion estimation algorithm based on block matching is suggested. In the proposed method the search area is adaptively found for each block of a frame. This search area is similar to that of the full search (FS) algorithm but smaller for most blocks of a frame. Therefore, the proposed algorithm is analogous to FS in terms of reg...